Multilayer Perceptrons: Approximation Order and Necessary Number of Hidden Units
نویسندگان
چکیده
منابع مشابه
Bounds on the number of hidden neurons in multilayer perceptrons
Fundamental issues concerning the capability of multilayer perceptrons with one hidden layer are investigated. The studies are focused on realizations of functions which map from a finite subset of E(n) into E(d). Real-valued and binary-valued functions are considered. In particular, a least upper bound is derived for the number of hidden neurons needed to realize an arbitrary function which ma...
متن کاملApproximation by Fully Complex Multilayer Perceptrons
We investigate the approximation ability of a multilayer perceptron (MLP) network when it is extended to the complex domain. The main challenge for processing complex data with neural networks has been the lack of bounded and analytic complex nonlinear activation functions in the complex domain, as stated by Liouville's theorem. To avoid the conflict between the boundedness and the analyticity ...
متن کاملHidden Node Pruning of Multilayer Perceptrons Based on Redundancy Reduction
Among many approaches to choosing the proper size of neural networks, one popular approach is to start with an oversized network and then prune it to a smaller size so as to attain better performance with less computational complexity. In this paper, a new hidden node pruning method is proposed based on the redundancy reduction among hidden nodes. The redundancy information is given by correlat...
متن کاملStochastic Approximation and Multilayer Perceptrons: The Gain Backpropagation Algorithm
A standard general algorithm, the stochastic approximation algorithm of Albert and Gardner [1] , is applied in a new context to compute the weights of a multilayer per ceptron network. This leads to a new algorithm, the gain backpropagation algorithm, which is related to, but significantly different from, the standard backpropagat ion algorith m [2]. Some simulation examples show the potential ...
متن کاملSome Estimates of Necessary Number of Connections and Hidden Units for Feed-Forward Networks
The feed-forward networks with fixed hidden units (FllU-networks) are compared against the category of remaining feed-forward networks with variable hidden units (VHU-networks). Two broad classes of tasks on a finite domain X C R n are considered: approximation of every function from an open subset of functions on X and representation of every dichotomy of X. For the first task it is found that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks
سال: 2008
ISSN: 1045-9227,1941-0093
DOI: 10.1109/tnn.2007.912306